Stationary Distribution Convergence for Generalized Jackson Networks in Heavy Traffic

نویسندگان

  • Amarjit Budhiraja
  • Chihoon Lee
چکیده

In a recent paper [5] it was shown that under suitable conditions stationary distributions of the (scaled) queue lengths process for a generalized Jackson network converge to the stationary distribution of the associated reflected Brownian motion in the heavy traffic limit. The proof relied on certain exponential integrability assumptions on the primitives of the network. In this note we provide an alternative proof of this result that does not require exponential integrability. The conditions that we impose (in addition to natural heavy traffic and stability assumptions) are precisely the i.i.d. and square integrability requirements on the network primitives that are typically made in heavy traffic analysis.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stationary Distribution Convergence for a Multiclass Single-server Queue in Heavy Traffic

In the author’s recent paper [11], it is established that in a multiclass single-server queue with regular service disciplines, the stationary distributions and their moments for workload as well as for queue length can be approximated by appropriate exponential distributions and their moments in the heavy-traffic regime. In this work, relaxing the assumption of moment generating function on th...

متن کامل

Validity of Heavy Traffic Steady - State Approximations in Generalized Jackson Networks

We consider a single class open queueing network, also known as a generalized Jackson network (GJN). A classical result in heavy-traffic theory asserts that the sequence of normalized queue length processes of the GJN converge weakly to a reflected Brownian motion (RBM) in the orthant, as the traffic intensity approaches unity. However, barring simple instances, it is still not known whether th...

متن کامل

Validity of Heavy Traffic Steady-state Approximations in Generalized Jackson Networks by David Gamarnik

We consider a single class open queueing network, also known as a generalized Jackson network (GJN). A classical result in heavy-traffic theory asserts that the sequence of normalized queue length processes of the GJN converge weakly to a reflected Brownian motion (RBM) in the orthant, as the traffic intensity approaches unity. However, barring simple instances, it is still not known whether th...

متن کامل

Validity of Heavy Traffic Steady-State Approximations in Open Queueing Networks

We consider a single class open queueing network, also known as a Generalized Jackson Network (GJN). A classical result in heavy traffic theory asserts that the sequence of normalized queue length processes of the GJN converge weakly to a Reflected Brownian Motion (RBM) in the orthant, as the traffic intensity approaches unity. However, barring simple instances, it is still not known whether th...

متن کامل

Sequential Bottleneck Decomposition: An Approximation Method for Generalized Jackson Networks

In heavy traffic analysis of open queueing networks, processes of interest such as queue lengths and workload levels are generally approximated by a multidimensional reflected Brownian motion (RBM). Decomposition approximations, on the other hand, typically analyze stations in the network separately, treating each as a single queue with adjusted interarrival time distribution. We present a hybr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Oper. Res.

دوره 34  شماره 

صفحات  -

تاریخ انتشار 2009